home *** CD-ROM | disk | FTP | other *** search
- Path: informatik.tu-muenchen.de!fischerj
- From: fischerj@informatik.tu-muenchen.de (Juergen "Rally" Fischer)
- Newsgroups: comp.sys.amiga.programmer
- Subject: Re: TMapping again!
- Date: 29 Feb 1996 12:22:00 GMT
- Organization: Technische Universitaet Muenchen, Germany
- Distribution: world
- Message-ID: <4h45p8$ilk@sunsystem5.informatik.tu-muenchen.de>
- References: <38232577@kone.fipnet.fi> <4gl167$r6s@oreig.uji.es> <38232663@kone.fipnet.fi>
- NNTP-Posting-Host: hphalle3g.informatik.tu-muenchen.de
- Originator: fischerj@hphalle3g.informatik.tu-muenchen.de
-
-
- In article <38232663@kone.fipnet.fi>, "Jyrki Saarinen" <jsaarinen@kone.fipnet.fi> writes:
- |>
- |> > What is faster? Dividing each 16 pixels or using forward differencing?
- |>
- |> Using more than one add per pixel? Quadratic or cubic?
- |> Well, I have some formulas for quadratic but they dont work.
- |>
- |> > Also, why is it that nobody (I think) uses z-constant texture mapping?
- |>
- |> I guess it is hard to do correctly without any holes between
- |> polygons.
-
- But it's possible, my friend did it :) Had to play around a lot with
- bresenham theory.
- Well, writing non-horiz in mem should cause no slowdown ?
- Don't know how much instructions he needed for that...
-
- |>
- |> -- _
- |> a Stellar programmer _ //
- |> "Amiga - back for the future" \X/
- ------------------------------------------------------------------------
- fischerj@Informatik.TU-Muenchen.DE (Juergen "Rally" Fischer) =:)
-
-